Log to log-log crossover of entanglement in a (1+1) -dimensional massive scalar field
نویسندگان
چکیده
منابع مشابه
StUSPACE(log n) <= DSPACE(log²n / log log n)
We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملLog Abelian Varieties over a Log Point
We study (weak) log abelian varieties with constant degeneration in the log flat topology. If the base is a log point, we further study the endomorphism algebras of log abelian varieties. In particular, we prove the dual short exact sequence for isogenies, Poincaré complete reducibility theorem for log abelian varieties, and the semisimplicity of the endomorphism algebras of log abelian varieti...
متن کاملThe log-log LMS algorithm
This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive lter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient. This eliminates the need for multipliers or shifters in the algorithm's update section. The q...
متن کاملRuspace(log N) Dspace(log 2 N= Log Log N) 1
We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کامل(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP
The aim of this paper is to present a proof of the equivalence of the equalities N P = PCP(log log n; 1) and P = N P. The proof is based on producing long pseudo-random bit strings through random walks on expander graphs. This technique also implies that for any language in N P there exists a restricted veriier using log n + c, c is a constant, random bits. Furthermore, we prove that the equali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 2021
ISSN: 2470-0010,2470-0029
DOI: 10.1103/physrevd.103.125008